Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
341	6.889 — Lecture 15: Traveling Salesman (TSP) Christian Sommer (figures by Philip Klein) November 2, 2011 Traveling Salesman Problem (TSP) given G = (V, E) find a tour visiting each1 node v ∈ V . NP–har Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-11-29 11:50:24 Spanning tree NP-complete problems Operations research Travelling salesman problem Graph operations Minimum spanning tree Graph Planar graph Eulerian path Graph theory Theoretical computer science Mathematics
342	UC Berkeley—CS 170 Lecturer: David Wagner Problem Set 12 Due on May 13 at 3:30 p.m. Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:42 NP-complete problems Complexity classes Mathematical optimization NP-complete P versus NP problem NP Time complexity Vertex cover Hamiltonian path Theoretical computer science Computational complexity theory Applied mathematics
343	An Implementation of Bigraph Matching Arne John Glenstrup ∗ , Troels Christoffer Damgaard, Lars Birkedal, Espen Højsgaard IT University of Copenhagen, Denmark Abstract We describe a provably sound and complete matchin Add to Reading List Source URL: www.itu.dk Language: English - Date: 2007-11-05 12:26:38 Parity of a permutation Permutations Lambda calculus Mathematics Group theory Parity
344	PDF Document Add to Reading List Source URL: web.eecs.umich.edu Language: English - Date: 2014-02-11 03:59:44 Combinatorial optimization NP-complete problems Matching Cut Shortest path problem Time complexity Maximum cut Travelling salesman problem Hungarian algorithm Theoretical computer science Graph theory Mathematics
345	BRICS Basic Research in Computer Science BRICS RSJ. M. Nielsen: On the Number of Maximal Independent Sets in a Graph On the Number of Maximal Independent Sets Add to Reading List Source URL: www.brics.dk Language: English - Date: 2002-04-12 04:11:55 NP-complete problems Maximal independent set Independent set Graph coloring Clique Extremal graph theory Domatic number Path decomposition Graph theory Theoretical computer science Mathematics
346	Quasi-Metric Spaces A Few Pearls in the Theory of Quasi-Metric Spaces Jean Goubault-Larrecq Add to Reading List Source URL: www.lsv.ens-cachan.fr Language: English - Date: 2013-07-09 05:01:45 Metric Complete metric space Quasi-isometry Geometry Metric geometry Metric space
347	Mathematical Programming manuscript No. (will be inserted by the editor) Sanjeev Arora ? Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2007-02-04 13:37:22 NP-complete problems Complexity classes Approximation algorithms Spanning tree Travelling salesman problem Polynomial-time approximation scheme Time complexity Optimization problem Algorithm Theoretical computer science Computational complexity theory Applied mathematics
348	CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:42:05 NP-complete problems Clique Travelling salesman problem Vertex cover NP-complete Cut Path decomposition Feedback vertex set Graph theory Theoretical computer science Mathematics
349	Shibuya et al. Algorithms for Molecular Biology 2010, 5:7 http://www.almob.org/contentRESEARCH Open Access Add to Reading List Source URL: www.almob.org Language: English Protein methods Bioinformatics Complexity classes Computational complexity theory Root-mean-square deviation Mathematical optimization Structural alignment Time complexity NP-complete Theoretical computer science Applied mathematics Statistics
350	UC Berkeley—CS 170: Efficient Algorithms and Intractable Problems Lecturer: David Wagner Handout 23 May 1, 2003 Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:42 NP-complete problems Complexity classes Bin packing problem NP Subset sum problem Partition problem Vertex cover Integer 3-partition problem Theoretical computer science Mathematics Computational complexity theory

UPDATE